Solving competitive location problems via memetic algorithms . High performance computing approaches
نویسندگان
چکیده
منابع مشابه
Competitive Memetic Algorithms for Arc Routing Problems
Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Abstract The Capacitated Arc Routing Problem or CARP arises in applications like waste collection or winter gritting. Metaheuristics are tools of choice for solving large instances of this NP-hard problem. The paper presents basic components tha...
متن کاملOckham's Razor in memetic computing: Three stage optimal memetic exploration
Memetic Computing is a subject in computer science which considers complex structures as the combination of simple agents, memes, whose evolutionary interactions lead to intelligent structures capable of problem-solving. This paper focuses on Memetic Computing optimization algorithms and proposes a counter-tendency approach for algorithmic design. Research in the field tends to go in the direct...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA MOS-based dynamic memetic differential evolution algorithm for continuous optimization: a scalability test
Continuous optimization is one of the areas with more activity in the field of heuristic optimization. Many algorithms have been proposed and compared on several benchmarks of functions, with different performance depending on the problems. For this reason, the combination of different search strategies seems desirable to obtain the best performance of each of these approaches. This contributio...
متن کاملFuzzy-evolutionary Algorithms Applied to Scheduling Problems
In this work, we will address three sequencing problems: Single Machine, Parallel Machine and Flowshop scheduling. The three problems were studied in previous contributions via approaches based on Memetic Algorithms (MAs). For this work, the original MAs were upgraded with the inclusion of an online running controller based on fuzzy logic for the previously fixed parameters of the evolutionary ...
متن کامل